منابع مشابه
On the Iterated Hairpin Completion
The (bounded) hairpin completion and its iterated versions are operations on formal languages which have been inspired by the hairpin formation in DNA-biochemistry. The paper answers two questions asked in the literature about the iterated hairpin completion. The first question is whether the class of regular languages is closed under iterated bounded hairpin completion. Here we show that this ...
متن کاملOn the Regularity of Iterated Hairpin Completion of a Single Word
Hairpin completion is an abstract operation modeling a DNA bio-operation which receives as input a DNA strand w = xαyα, and outputs w′ = xαyᾱx, where x denotes the WatsonCrick complement of x. In this paper, we focus on the problem of finding conditions under which the iterated hairpin completion of a given word is regular. According to the numbers of words α and α that initiate hairpin complet...
متن کاملIterated Hairpin Completions of Non-crossing Words
Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or more precisely a singleton language) is always a context-sensitive language and for some words it is known to be non-context-free. However, it is unknown whether regularity of iterated hairpin completion of a given word is decid...
متن کاملOn Some Algorithmic Problems Regarding the Hairpin Completion
It is known that a single stranded DNA molecule might produce a hairpin structure due to two biological principles, namely Watson-Crick complementarity and annealing. In many DNA-based algorithms, these DNA molecules cannot be used in the subsequent computations. Hairpin or hairpin-free DNA structures have numerous applications to DNA computing and molecular genetics. Suggested by the two afore...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.03.009